Undecidability of Context-Sensitive Data-Dependence Analysis

نویسنده

  • THOMAS REPS
چکیده

A number of program-analysis problems can be tackled by transforming them into certain kinds of graph-reachability problems in labeled directed graphs. The edge labels can be used to filter out paths that are not of interest: A path P from vertex s to vertex t only counts as a “valid connection” between s and t if the word spelled out by P is in a certain language. Often the languages used for such filtering purposes are languages of matching parentheses:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing a Model for Managing the Ethical and Job Attitudes of Employees in Government Agencies

Background: The purpose of this study is to design a model for managing the ethical and professional attitude of employees in government organizations. Method: The present research method is a mixed (qualitative-quantitative) research. In the qualitative part, the strategy used was the Foundationchr('39')s data theory (Grand Theory). The statistical population consisted of university professor...

متن کامل

A Reliable Routing Algorithm for Delay Sensitive Data in Body Area Networks

Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive da...

متن کامل

A Tableau Calculus for Multimodal Logics and Some (Un)Decidability Results

In this paper we present a prefixed analytic tableau calculus for a class of normal multimodal logics and we present some results about decidability and undecidability of this class. The class is characterized by axioms of the form [t1] . . . [tn]φ ⊃ [s1] . . . [sm]φ, called inclusion axioms, where the ti’s and sj ’s are constants. This class of logics, called grammar logics, was introduced for...

متن کامل

Supporting Array Dependence Testing for an Optimizing/Parallelizing C Compiler

A practical context-sensitive inter-procedural analysis framework for c compilers. [Mas92] Vadim Maslov. Delinearization : An ecient way to break multiloop dependence equations. The omega test : A fast and practical integer programming algorithm for dependence analysis.

متن کامل

Context-Dependent Data Envelopment Analysis-Measuring Attractiveness and Progress with Interval Data

Data envelopment analysis (DEA) is a method for recognizing the efficient frontier of decision making units (DMUs).This paper presents a Context-dependent DEA which uses the interval inputs and outputs. Context-dependent approach with interval inputs and outputs can consider a set of DMUs against the special context. Each context shows an efficient frontier including DMUs in particular l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999